FEM for Elliptic Eigenvalue Problems: How Coarse Can the Coarsest Mesh be Chosen? An Experimental Study
نویسندگان
چکیده
In this paper, we consider the numerical discretization of elliptic eigenvalue problems by Finite Element Methods and its solution by a multigrid method. From the general theory of finite element and multigrid methods, it is well known that the asymptotic convergence rates become visible only if the mesh width h is sufficiently small, h ≤ h0. We investigate the dependence of the maximal mesh width h0 on various problem parameters such as the size of the eigenvalue and its isolation distance. In a recent paper [19], the dependence of h0 on these and other parameters has been investigated theoretically. The main focus of this paper is to perform systematic experimental studies to validate the sharpness of the theoretical estimates and to get more insights in the convergence of the eigenfunctions and -values in the pre-asymptotic regime.
منابع مشابه
An Iterative Finite Element Method for Elliptic Eigenvalue Problems
We consider the task of resolving accurately the nth eigenpair of a generalized eigenproblem rooted in some elliptic partial differential equation (PDE), using an adaptive finite element method (FEM). Conventional adaptive FEM algorithms call a generalized eigensolver after each mesh refinement step. This is not practical in our situation since the generalized eigensolver needs to calculate n e...
متن کاملOn the robustness of hierarchical multilevel splittings for discontinuous Galerkin rotated bilinear FE problems
In this paper we present a new framework for multilevel preconditioning of large sparse systems of linear algebraic equations arising from the interior penalty discontinuous Galerkin approximation of second-order elliptic boundary value problems. Though the focus is on a particular family of rotated bilinear non-conforming (Rannacher-Turek) finite elements in two space dimensions (2D) the propo...
متن کاملAssessment of methods for the numerical solution of the Fredholm integral eigenvalue problem
The computational efficiency of random field representations with the Karhunen-Loève expansion relies on the numerical solution of a Fredholm integral eigenvalue problem. In this contribution, different methods for this task are compared. These include the finite element method (FEM), the finite cell method (FCM) and the Nyström method. For the FEM with linear basis functions, two different app...
متن کاملSolving Mesh Eigenproblems with Multigrid Efficiency
Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow to compute a few of the smallest eigenvalues and the eigenfunctions within optimal or quasi-optimal computational complexity. A review is given on three multigrid solvers for elliptic eigenproblems. Numerical results are presented for a simple model problem.
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007